Termination Proof Script
Consider the TRS R consisting of the rewrite rules
|
| 1: |
|
f(a,f(b,x)) |
→ f(a,f(a,f(a,x))) |
| 2: |
|
f(b,f(a,x)) |
→ f(b,f(b,f(b,x))) |
|
There are 6 dependency pairs:
|
| 3: |
|
F(a,f(b,x)) |
→ F(a,f(a,f(a,x))) |
| 4: |
|
F(a,f(b,x)) |
→ F(a,f(a,x)) |
| 5: |
|
F(a,f(b,x)) |
→ F(a,x) |
| 6: |
|
F(b,f(a,x)) |
→ F(b,f(b,f(b,x))) |
| 7: |
|
F(b,f(a,x)) |
→ F(b,f(b,x)) |
| 8: |
|
F(b,f(a,x)) |
→ F(b,x) |
|
The approximated dependency graph contains 2 SCCs:
{3-5}
and {6-8}.
-
Consider the SCC {3-5}.
The constraints could not be solved.
-
Consider the SCC {6-8}.
The constraints could not be solved.
Tyrolean Termination Tool (0.06 seconds)
--- May 3, 2006